The P-Hub maximal covering problem and extensions for gradual decay functions
نویسندگان
چکیده
منابع مشابه
Hub Covering Location Problem under Gradual Decay Function
This paper developed a mathematical model framework using the single allocation strategy for hub covering location problem. The model encompassed the transportation time covering under gradual decay function. Within a certain transportation time for the origin and destination nodes among two hubs, the route is fully covered, and beyond another specified transportation time the route is not cove...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملA modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments
Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2015
ISSN: 0305-0483
DOI: 10.1016/j.omega.2015.01.009